On Biembedding an Idempotent Latin Square with Its Transpose
نویسندگان
چکیده
Let L be an idempotent Latin square of side n, thought of as a set of ordered triples (i, j, k) where L(i, j) = k. Let I be the set of triples (i, i, i). We consider the problem of biembedding the triples of L \ I with the triples of L′ \ I, where L′ is the transpose of L, in an orientable surface. We construct such embeddings for all doubly even values of n.
منابع مشابه
Quarter-regular biembeddings of Latin squares
In this talk I will review the concept of the biembedding of two latin squares. Of particular interest will be the regular biemedding of two isomorphic copies of the latin square corresponding to the cyclic group of order n, denoted Cn. Grannell and Griggs have shown that, for all n, a regular biembedding exists, and in addition, that the automorphism group of the regular biembedding has order ...
متن کاملOn the existence of self-orthogonal diagonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. A Latin square is self-orthogonal if it is orthogonal to its transpose. In an earlier paper Danhof, Phillips and Wallis considered the question of the existence of self-orthogonal diagonal Latin squares of order 10. In this paper we shall present some constructions of self-orthogonal diagonal ...
متن کاملA constraint on the biembedding of Latin squares
A biembedding of two latin squares of order n is equivalent to a face 2-colourable triangulation of Kn,n,n. We consider the following question: Given two latin squares A and B of order n, is there any relabelling of A and B for which there exists a biembedding? Grannell, Griggs and Knor answered this question computationally for n ≤ 7. A main class of latin squares is a set of latin squares whi...
متن کاملA Solution to the Embedding Problem for Partial Idempotent Latin Squares
A partial latin square on t symbols <rl5..., ut of side n is an n x n matrix, each of the cells of which may be empty or may be occupied by. one of the symbols ol,..., at, and which satisfies the rule that no symbol occurs more than once in any row or more than once in any column. An incomplete latin square on t symbols of side n is a partial latin square in which there are no empty cells; it i...
متن کاملFinite Embedding Theorems for Partial Latin Squares, Quasi-groups, and Loops
In this paper we prove that a finite partial commutative (idempotent commutative) Latin square can be embedded in a finite commutative (idempotent commutative) Latin square. These results are then used to show that the loop varieties defined by any non-empty subset of the identities {x(xy) = y, (yx)x = y} and the quasi-group varieties defined by any non-empty subset of {x” = x, x(xy) = y, (yx)x...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013